Quality Function Deployment in Agile Parallel Machine Scheduling Through Neural Network Technique
نویسندگان
چکیده
منابع مشابه
Using Linear Physical Programming in Optimizing Fuzzy Quality Function Deployment
Quality function deployment (QFD) is a customer-driven quality management and product development system for achieving higher customer satisfaction. It is necessary to determine relationships between customer requirements (CRs) and technical requirements (TRs), as well as correlation among the TRs themselves. Such data are usually ambiguous and fuzzy and people have different judgments about th...
متن کاملAi-supported Quality Function Deployment Abstract| Manual Quality Function Deployment
(QFD) tools are limited in their use and their reuse. Computational tools can alleviate these limitations. In addition, Artiicial Intelligence (AI) tools can further enhance the functionality of QFD tools. A graph-based information representation is proposed as the basis for integrating various QFD and AI tools. An architecture of a computational QFD (CQFD) tool based on the graph-based mod-eli...
متن کاملApplication of Analytical Network Process in Quality Function Deployment
A combined two established techniques, namely the Quality Function Deployment (QFD) and the Analytic Network Process (ANP) use in product development process. In this paper shows the how to use ANP decision making tool in QFD matrix. Combine the QFD and ANP method to determine the overall priorities of ECs. The ANP is a multi criteria decision-making method used to derive relative priority from...
متن کاملParallel Machine Scheduling Problem
A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...
متن کاملParallel Machine Batch Scheduling
The problem of scheduling G groups of jobs on m unrelated parallel machines is considered. Each group consists of several identical jobs. Implicit in a schedule is a partition of a group into batches; all jobs of a batch are processed jointly. It is possible for diierent batches of the same group to be processed concurrently on diierent machines. However, at any time, a batch can be processed o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian Journal of Scientific Research
سال: 2008
ISSN: 1992-1454
DOI: 10.3923/ajsr.2008.146.152